Fast simplicial quadrature-based finite element operators using Bernstein polynomials
نویسندگان
چکیده
We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in [14].
منابع مشابه
Bernstein-Bézier Finite Elements of Arbitrary Order and Optimal Assembly Procedures
Algorithms are presented that enable the element matrices for the standard finite element space, consisting of continuous piecewise polynomials of degree n on simplicial elements in R, to be computed in optimal complexity O(n). The algorithms (i) take account of numerical quadrature; (ii) are applicable to non-linear problems; and, (iii) do not rely on pre-computed arrays containing values of o...
متن کاملFast simplicial finite element algorithms using Bernstein polynomials
Fast algorithms for applying finite element mass and stiffness operators to the B-form of polynomials over d-dimensional simplices are derived. These rely on special properties of the Bernstein basis and lead to stiffness matrix algorithms with the same asymptotic complexity as tensor-product techniques in rectangular domains. First, special structure leading to fast application of mass matrice...
متن کاملNumerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملOn Group Fourier Analysis and Symmetry Preserving Discretizations of PDEs
In this paper we review some group theoretic techniques applied to discretizations of PDEs. Inspired by the recent years active research in Lie groupand exponential time integrators for differential equations, we will in the first part of the article present algorithms for computing matrix exponentials based on Fourier transforms on finite groups. As an example, we consider spherically symmetri...
متن کاملApproximate solution of system of nonlinear Volterra integro-differential equations by using Bernstein collocation method
This paper presents a numerical matrix method based on Bernstein polynomials (BPs) for approximate the solution of a system of m-th order nonlinear Volterra integro-differential equations under initial conditions. The approach is based on operational matrices of BPs. Using the collocation points,this approach reduces the systems of Volterra integro-differential equations associated with the giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerische Mathematik
دوره 121 شماره
صفحات -
تاریخ انتشار 2012